Indexing labeled sequences
نویسندگان
چکیده
منابع مشابه
Indexing Interpolated Time Sequences
A time sequence is a discrete sequence of values, e.g. temperature measurements, varying over time. By applying an interpolation function a discrete time sequence can be coerced into a continues function over time, F(t), which we call an interpolated time sequence. Many applications need to deal with querying interpolated time sequences. Simple queries involve finding F(t’) for a given time poi...
متن کاملIndexing Similar DNA Sequences
To study the genetic variations of a species, we need to consider a large number of very similar genomic sequences (e.g., a set of genes from normal people and different patients). A basic operation is to search the occurrences of a given pattern in these sequences. A straightforward approach is to concatenate these sequences as a long text, then build an indexing data structure (e.g., suffix t...
متن کاملIndexing protein sequences with MINOS
This paper concerns the use of an object-oriented database for the analysis of protein sequences. We describe proteins either by bibliographic information or by prediction function such as Prosite patterns [2, 5]. We propose to use concept lattices|a tool used in information retrieval to build thesauruses|to classify protein sequences. This classi cation of proteins may help nding sequence alig...
متن کاملIndexing Weighted Sequences: Neat and Efficient
In a weighted sequence, for every position of the sequence and every letter of the alphabet a probability of occurrence of this letter at this position is specified. Weighted sequences are commonly used to represent imprecise or uncertain data, for example, in molecular biology where they are known under the name of Position-Weight Matrices. Given a probability threshold 1 z , we say that a str...
متن کاملPersistent Indexing Technology for Large Sequences
There are two aspects to the work being presented here. The first is a novel persistent index structure for genomic data, a prototype of which has been completed. The second, using this index as an example, is a generic index development framework, which is under construction. We propose a variation of the suffix tree, the Top Compressed Suffix Tree, which has been designed to allow the on-disk...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PeerJ Computer Science
سال: 2018
ISSN: 2376-5992
DOI: 10.7717/peerj-cs.148